96 research outputs found

    TrackMania is NP-complete

    Full text link
    We prove that completing an untimed, unbounded track in TrackMania Nations Forever is NP-complete by using a reduction from 3-SAT and showing that a solution can be checked in polynomial time

    Mapping distributional to model-theoretic semantic spaces: a baseline

    Get PDF
    • …
    corecore